package leetcode.editor.cn;
 
/**
 * 不同路径
 * @author qulq
 * @date 2024-07-23 20:08:10
 */
public class T62_UniquePaths{
	 public static void main(String[] args) {
	 	 // 测试代码
	 	 Solution solution = new T62_UniquePaths().new Solution();
	 }
	 
// 力扣代码
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int uniquePaths(int m, int n) {
		int[][] dp = new int[m][n];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				if (i == 0 || j == 0) {
					dp[i][j] = 1;
				} else {
					dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
				}
			}
		}
		return dp[m - 1][n - 1];
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}